Efficiently enclosing the compact binary parameter space by singular-value decomposition
نویسندگان
چکیده
Kipp Cannon,* Chad Hanna, and Drew Keppel LIGO Laboratory, California Institute of Technology, Pasadena, California 91125, USA Canadian Institute for Theoretical Astrophysics, 60 St. George Street, University of Toronto, Toronto, Ontario M5S 3H8, Canada Perimeter Institute for Theoretical Physics, Waterloo, Ontario N2L 2Y5, Canada Theoretical Astrophysics, California Institute of Technology, Pasadena, California 91125, USA Albert-Einstein-Institut, Max-Planck-Institut für Gravitationsphysik, D-30167 Hannover, Germany Leibniz Universität Hannover, D-30167 Hannover, Germany (Received 27 January 2011; published 4 October 2011)
منابع مشابه
A Dimensionless Parameter Approach based on Singular Value Decomposition and Evolutionary Algorithm for Prediction of Carbamazepine Particles Size
The particle size control of drug is one of the most important factors affecting the efficiency of the nano-drug production in confined liquid impinging jets. In the present research, for this investigation the confined liquid impinging jet was used to produce nanoparticles of Carbamazepine. The effects of several parameters such as concentration, solution and anti-solvent flow rate and solvent...
متن کاملLarge-scale Inversion of Magnetic Data Using Golub-Kahan Bidiagonalization with Truncated Generalized Cross Validation for Regularization Parameter Estimation
In this paper a fast method for large-scale sparse inversion of magnetic data is considered. The L1-norm stabilizer is used to generate models with sharp and distinct interfaces. To deal with the non-linearity introduced by the L1-norm, a model-space iteratively reweighted least squares algorithm is used. The original model matrix is factorized using the Golub-Kahan bidiagonalization that proje...
متن کاملNew Fusion of SVD and DCT-LBP for Face Recognition
In this paper, we proposed the fusion of two projection based face recognition algorithms: local binary Patterns in DCT domain and singular value decomposition (SVD) characterized by its simplicity and efficiently. Standard databases ORL are used to test the experimental results which prove that proposed system achieves more accurate face recognition as compared to individual method.
متن کاملGraph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members
Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...
متن کاملSingular Value Decomposition Geršgorin Sets
Abstract: In this note, we introduce the singular value decomposition Geršgorin set, Γ (A), of an N ×N complex matrix A, where N ≤ ∞. For N finite, the set Γ (A) is similar to the standard Geršgorin set, Γ(A), in that it is a union of N closed disks in the complex plane and it contains the spectrum, σ(A), of A. However, Γ (A) is constructed using column sums of singular value decomposition matr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011